Bounds on Worst-Case Deadline Failure Probabilities in Controller Area Networks
نویسندگان
چکیده
منابع مشابه
Worst-Case Upper Bounds
There are many algorithms for testing satisfiability — how to evaluate and compare them? It is common (but still disputable) to identify the efficiency of an algorithm with its worst-case complexity. From this point of view, asymptotic upper bounds on the worst-case running time and space is a criterion for evaluation and comparison of algorithms. In this chapter we survey ideas and techniques ...
متن کاملWorst - Case Tail Probabilities in Credit Risk
Simulation is widely used to measure credit risk in portfolios of loans, bonds, and other instruments subject to possible default. This analysis requires performing the difficult modeling task of capturing the dependence between obligors adequately. Current methods assume a form for the joint distribution of the obligors and match its parameters to given dependence specifications, usually corre...
متن کاملWorst case response time versus worst case offset configuration using the deadline driven scheduler
We study the worst case response in the scheduling of hard real-time periodic task sets with the deadline driven scheduler. We show that the worst case response times do not always occur in the synchronous schedule; even worse, the worst response times for the various tasks do not necessarily occur in the same asynchronous schedule.
متن کاملOn domain-partitioning induction criteria: worst-case bounds for the worst-case based
One of the most popular induction scheme for supervised learning is also one of the oldest. It builds a classi3er in a top-down fashion, following the minimization of a so-called index criterion. While numerous papers have reported experiments on this scheme, little has been known on its theoretical aspect until recent works on decision trees and branching programs using a powerful classi3catio...
متن کاملWorst-Case Bounds for Gaussian Process Models
We present a competitive analysis of some non-parametric Bayesian algorithms in a worst-case online learning setting, where no probabilistic assumptions about the generation of the data are made. We consider models which use a Gaussian process prior (over the space of all functions) and provide bounds on the regret (under the log loss) for commonly used non-parametric Bayesian algorithms — incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Networks and Communications
سال: 2016
ISSN: 2090-7141,2090-715X
DOI: 10.1155/2016/5196092